منابع مشابه
Periodic Sorting Using Minimum Delay, Recursively Constructed Merging Networks
Let α and β be a partition of {1, . . . , n} into two blocks. A merging network is a network of comparators which allows as input arbitrary real numbers and has the property that, whenever the input sequence x1, x2, . . . , xn is such that the subsequence in the positions α and the subsequence in the positions β are each sorted, the output sequence will be sorted. We study the class of “recursi...
متن کاملStable Minimum Storage Merging by Symmetric Comparisons
We introduce a new stable minimum storage algorithm for merging that needs O(m log( n m +1)) element comparisons, where m and n are the sizes of the input sequences with m ≤ n. According to the lower bound for merging, our algorithm is asymptotically optimal regarding the number of comparisons. The presented algorithm rearranges the elements to be merged by rotations, where the areas to be rota...
متن کاملOn Optimal Merging Networks
Kazuyuki Amano? and Akira Maruoka Graduate S hool of Information S ien es, Tohoku University Aoba 05, Aramaki, Sendai 980-8579 JAPAN fama|maruokag e ei.tohoku.a .jp Tel:+81-22-217-7149, Fax:+81-22-263-9414 Abstra t. We prove that Bat her's odd-even (m;n)-merging networks are exa tly optimal for (m;n) = (3; 4k + 2) and (4; 4k + 2) for k 0 in terms of the number of omparators used. For other ases...
متن کاملMerging Similarity and Trust Based Social Networks to Enhance the Accuracy of Trust-Aware Recommender Systems
In recent years, collaborative filtering (CF) methods are important and widely accepted techniques are available for recommender systems. One of these techniques is user based that produces useful recommendations based on the similarity by the ratings of likeminded users. However, these systems suffer from several inherent shortcomings such as data sparsity and cold start problems. With the dev...
متن کاملFaster 3-Periodic Merging Networks
We consider the problem of merging two sorted sequences on a comparator network that is used repeatedly, that is, if the output is not sorted, the network is applied again using the output as input. The challenging task is to construct such networks of small depth. The first constructions of merging networks with a constant period were given by Kutyłowski, Loryś and Oesterdikhoff [7]. They have...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.09.003